Realization of Tree Adjoining Grammars with Uni cation
نویسنده
چکیده
The syntactic generator of the WIP system is based on the representation formalism`Tree Adjoining Grammars' (TAGs). We have extended the formalism by associating elementary rules of the grammar (trees) with feature structures, leading tòTree Adjoining Grammars with Uniication' (UTAGs). The extended formalism facilitates a compact and adequate representation of complex syntactic features. The contradiction between the monotonic operation of uniication and the combination operation for trees { adjunction { that is nonmonotonic in a way can be solved by several diierent approaches to realization. Two of them are presented in this report and compared with respect to the restrictions that are given by the system, i.e., the adequacy of the realization for incremental and parallel generation. It can be shown that UTAGs are subsumed by FTAGs (Feature Structure based TAGs) that have been deened by Vijay-Shanker and Joshi. That is why the results for realization can be applied to both UTAGs and a restricted version of FTAGs.
منابع مشابه
PreRkTAG: Prediction of RNA Knotted Structures Using Tree Adjoining Grammars
Background: RNA molecules play many important regulatory, catalytic and structural <span style="font-variant: normal; font-style: norma...
متن کاملGenerating Parallel Multilingual LFG-TAG Grammars from a MetaGrammar
We introduce a MetaGrammar, which allows us to automatically generate, from a single and compact MetaGrammar hierarchy, parallel Lexical Functional Grammars (LFG) and Tree-Adjoining Grammars (TAG) for French and for English: the grammar writer specifies in compact manner syntactic properties that are potentially framework-, and to some extent language-independent (such as subcategorization, val...
متن کاملAutomatically Generating Tree Adjoining Grammars from Abstract Specifications
The paper describes a system that can automatically generate tree adjoining grammars from abstract specifications. Our system is based on the use of tree descriptions to specify a grammar by separately defining pieces of tree structure that encode independent syntactic principles. Various individual specifications are then combined to form the elementary trees of the grammar. The system enables...
متن کاملMapping Scrambled Korean Sentences into English Using Synchronous TAGs
plg /9 50 50 29 13 M ay 1 99 5 Mapping Scrambled Korean Sentences into English Using Synchronous TAGs Hyun S. Park Computer Laboratory University of Cambridge Cambridge, CB2 3QG, U.K. [email protected] Abstract Synchronous Tree Adjoining Grammars can be used for Machine Translation. However, translating a free order language such as Korean to English is complicated. I present a mechanism t...
متن کاملMultiple Context-Free Tree Grammars and Multi-component Tree Adjoining Grammars
Strong lexicalization is the process of turning a grammar generating trees into an equivalent one, in which all rules contain a terminal leaf. It is known that tree adjoining grammars cannot be strongly lexicalized, whereas the more powerful simple context-free tree grammars can. It is demonstrated that multiple simple context-free tree grammars are as expressive as multi-component tree adjoini...
متن کامل